منابع مشابه
Provability in predicate product logic
We sharpen Hájek’s Completeness Theorem for theories extending predicate product logic, Π∀. By relating provability in this system to embedding properties of ordered abelian groups we construct a universal BL-chain L in the sense that a sentence is provable from Π∀ if and only if it is an L-tautology. As well we characterize the class of lexicographic sums that have this universality property.
متن کاملThe Logic of Provability
This chapter is dedicated to the memory of George Boolos. From the start of the subject until his death on 27 May 1996 he was the prime inspirer of the work in the logic of provability.
متن کاملConstructive Provability Logic 1
We present two variants of an intuitionistic sequent calculus that validates the Löb rule and permits logical reflection over provability. We explore properties of both variants of this logic, which we call constructive provability logic due to its close ties to Gödel-Löb provability logic.
متن کاملConstructive Provability Logic
We present constructive provability logic, an intuitionstic modal logic that validates the Löb rule of Gödel and Löb’s provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and CPL*, are presented in natural deduction and sequent calculus forms which are then shown to be equivalent. In addition, we discuss the use of constructive provabili...
متن کاملNotes on Provability Logic
This notes provides a brief survey that reflects the early development of provability logic. It includes a detailed exposition of Gödel’s incompleteness results, the Löb theorem, and the arithmetical completeness theorems of Solovay.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2007
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-007-0036-4